Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
نویسندگان
چکیده
منابع مشابه
Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
This paper investigates the semi-online version of scheduling problemP ||Cmax on a three-machine system.We assume that all jobs have their processing times between p and rp (p> 0, r 1).We give a comprehensive competitive ratio of LS algorithm which is a piecewise function on r 1. It shows that LS is an optimal semi-online algorithm for every r ∈ [1, 1.5], [√3, 2] and [6,+∞).We further present a...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملOnline scheduling of two type parallel jobs on identical machines
In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using " temporary schedule " .
متن کاملSemi-online scheduling for jobs with release times
In this paper we consider three semi-online scheduling problems for jobs with release times on m identical parallel machines. The worst case performance ratios of the LS algorithm are analyzed. The objective function is to minimize the maximum completion time of all machines, i.e. the makespan. If the job list has a nondecreasing release times, then 2− 1 m is the tight bound of the worst case p...
متن کاملonline scheduling of jobs for d-benevolent instances on identical machines
we consider online scheduling of jobs with speci c release time on m identical machines. each job has a weight and a size; the goal is maximizing total weight of completed jobs. at release time of a job it must immediately be scheduled on a machine or it will be rejected. it is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.12.005